The complexity of colouring by locally semicomplete digraphs
نویسندگان
چکیده
In this paper we establish a dichotomy theorem for the complexity of homomorphisms to fixed locally semicomplete digraphs. It is also shown that the same dichotomy holds for list homomorphisms. The polynomial algorithms follow from a different, shorter proof of a result by Gutjahr, Welzl and Woeginger.
منابع مشابه
Out-colourings of Digraphs
We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring. The problem of deciding whether a given digraph has an out-colouring with only two colours (called a 2-out-colouring) is NP-complete. We show that for every choice of positive integers r, k there exists a k-strong bipartite tournament which needs at least r colours in...
متن کاملA classification of arc-locally semicomplete digraphs
Tournaments are without doubt the best studied class of directed graphs [3, 6]. The generalizations of tournaments arise in order to extend the well-known results on tournaments to more general classes of directed graphs. Moreover, the knowledge about generalizations of tournaments has allowed to deepen our understanding of tournaments themselves. The semicomplete digraphs, the semicomplete mul...
متن کاملA classification of locally semicomplete digraphs
In [19] Huang gave a characterization of local tournaments. His characterization involves arc-reversals and therefore may not be easily used to solve other structural problems on locally semicomplete digraphs (where one deals with a fixed locally semicomplete digraph). In this paper we derive a classification of locally semicomplete digraphs which is very useful for studying structural properti...
متن کاملLOCALLY SEMICOMPLETE DIGRAPHS WITH A FACTOR COMPOSED OF k CYCLES
A digraph is locally semicomplete if for every vertex x, the set of in-neighbors as well as the set of out-neighbors of x induce semicomplete digraphs. Let D be a k-connected locally semicomplete digraph with k ≥ 3 and g denote the length of a longest induced cycle of D. It is shown that if D has at least 7(k− 1)g vertices, then D has a factor composed of k cycles; furthermore, if D is semicomp...
متن کاملEfficient total domination in digraphs
We generalize the concept of efficient total domination from graphs to digraphs. An efficiently total dominating set X of a digraph D is a vertex subset such that every vertex of D has exactly one predecessor in X . We study graphs that permit an orientation having such a set and give complexity results and characterizations concerning this question. Furthermore, we study the computational comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 310 شماره
صفحات -
تاریخ انتشار 2010